Simulated annealing with time-dependent energy function via Sobolev inequalities
نویسندگان
چکیده
منابع مشابه
Energy Transforms for Metropolis and Simulated Annealing Algorithms Energy Transforms for Metropolis and Simulated Annealing Algorithms
We present here a method to speed up Metropolis algorithms which can be viewed as an alternative to simulated annealing. We show that this method of energy transformation compares favourably with simulated annealing in the asymptotic of a close to one probability of convergence. It requires an estimate of the minimum value of the energy function to be known, but if only a loose estimate is avai...
متن کاملFuzzy linear programming via simulated annealing
This paper shows how the simulated annealing (SA) algorithm provides a simple tool for solving fuzzy optimization problems. Often, the issue is not so much how to fuzzify or remove the conceptual imprecision, but which tools enable simple solutions for these intrinsically uncertain problems. A well-known linear programming example is used to discuss the suitability of the SA algorithm for solvi...
متن کاملAnalysis of kinesin mechanochemistry via simulated annealing
The molecular motor protein kinesin plays a key role in fundamental cellular processes such as intracellular transport, mitotic spindle formation, and cytokinesis, with important implications for neurodegenerative and cancer disease pathways. Recently, kinesin has been studied as a paradigm for the tailored design of nano-bio sensor and other nanoscale systems. As it processes along a microtubu...
متن کاملMultiple association analysis via simulated annealing (MASSA)
SUMMARY Genome-wide association studies are now technically feasible and likely to become a fundamental tool in unraveling the ultimate genetic basis of complex traits. However, new statistical and computational methods need to be developed to extract the maximum information in a realistic computing time. Here we propose a new method for multiple association analysis via simulated annealing tha...
متن کاملClustering via Support Vector Machine Boosting with Simulated Annealing
SVMs are shown to be effective at clustering when used with metaheuristics to recover label information in a bootstrap learning process. An automated tuning solution for Support Vector Machine (SVM) classification and clustering methods is described. This is shown for two complemetary situations: (1) by implementing a simulated annealing with perturbation tuning procedure on the relabeler-SVM b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 1996
ISSN: 0304-4149
DOI: 10.1016/0304-4149(96)00070-1